An information-spectrum approach to joint source-channel coding

Given a general source V = fV gn=1 with countably in nite source alphabet and a general channel W = fW ng1 n=1 with arbitrary abstract channel input and output alphabets, we study the joint source-channel coding problem from the information-spectrum point of view. First, we generalize Feinstein's lemma (direct part) and Verd u-Han's lemma (converse part) so as to be applicable to the general joint source-channel coding problem. Based on these lemmas, we establish a su cient condition as well as a necessary condition for the source V to be reliably transmissible over the channel W with asymptotically vanishing probability of error. It is shown that our su cient condition coincides with the su cient condition derived by Vembu, Verd u and Steinberg, whereas our necessary condition is much stronger than the necessary condition derived by them. Actually, our necessary condition coincide with our su cient condition if we disregard some asymptotically vanishing terms appearing in those conditions. Also, it is shown that Separation Theorem in the generalized sense always holds. In addition, we demonstrate a su cient condition as well as a necessary condition for the "-transmissibility (0 " < 1). Finally, the separation theorem of the traditional standard form is shown to hold for the class of sources and channels that satisfy the ( semi-) strong converse property.